Polynomial-time approximation scheme - PDFSEARCH.IO - Document Search Engine

Polynomial-time approximation scheme
Results: 52

#	Item
41	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
42	Local Approximation Schemes for Ad Hoc and Sensor ∗ Networks Fabian Kuhn Thomas Moscibroda Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-23 16:10:38 NP-complete problems Dominating set Unit disk graph Connected dominating set Graph coloring Independent set Polynomial-time approximation scheme Bidimensionality Domatic number Graph theory Theoretical computer science Computational complexity theory
43	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
44	Part II Approximation Algorithms Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2011-02-08 14:10:43 Operations research Mathematical optimization Combinatorial optimization NP-complete problems Knapsack problem Polynomial-time approximation scheme Dynamic programming Approximation algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
45	CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Language: English - Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics
46	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
47	More Efficient Algorithms for Closest String and Substring Problems Bin Ma1 and Xiaoming Sun2 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2008-03-04 00:32:19 Complexity classes Analysis of algorithms NP-complete problems Approximation algorithms Closest string Polynomial-time approximation scheme Parameterized complexity Time complexity String Theoretical computer science Computational complexity theory Applied mathematics
48	The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2010-06-16 06:52:36 Complexity classes Sanjeev Arora Polynomial-time approximation scheme Travelling salesman problem Approximation algorithm PTAS NP APX Joseph S. B. Mitchell Theoretical computer science Computational complexity theory Applied mathematics
49	A QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME FOR MINIMUM WEIGHT TRIANGULATION JAN REMY AND ANGELIKA STEGER Add to Reading List Source URL: www.cadmo.ethz.ch Language: English - Date: 2007-08-20 05:29:08 Topology Delaunay triangulation Convex hull Minimum-weight triangulation Pseudotriangle Area Point set triangulation Pitteway triangulation Triangulation Geometry Mathematics
50	PDF Document Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-09-09 07:23:49 Approximation algorithms NP-complete problems Complexity classes Operations research Travelling salesman problem APX Polynomial-time approximation scheme Time complexity Set TSP problem Theoretical computer science Computational complexity theory Applied mathematics